Modelling the Performance of an Implicit Memory-Based Technique in Solving Dynamic Scheduling Problems Through Response Surface Methodology

نویسندگان

  • Manuel Blanco ABELLO
  • Zbigniew MICHALEWICZ
چکیده

Response Surface Methodology (RSM) is a popular class of methods used to build empirical models through statistical means. Rarely in the literature is the RSM applied to model characteristics of Evolutionary Algorithm (EA) based techniques used to solve dynamic optimization problems. This paper presents RSM as a modelling tool of some characteristics of a memory and EA-based approach referred to as McBAR – the Mapping of Task IDs for Centroid-Based Adaptation with Random Immigrants. McBAR is applied to solve a class of multi-objective dynamic resource-constrained project scheduling problems where the total number of schedule-comprising tasks varies in time. In this paper we: (a) Determine EA-related parameters of which the EA-based techniques under consideration (including McBAR) can produce high-quality solutions to the above scheduling problems. This parametric search applies an innovated Split-plot approach that applies the RSM. (b) Create models through a novel method of applying the RSM in the EA domain. These models characterize certain capabilities of the techniques equipped with the determined EA-related parameters. The capabilities are in searching for solutions to the scheduling problems. (c) Legitimize the algorithmic components of McBAR through the models. (d) Illustrate the solution-searching abilities of the techniques under the dynamics of the scheduling problems. (e) Determine the limitations of the techniques under these dynamics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consolidated Technique of Response Surface Methodology and Data Envelopment Analysis for setting the parameters of meta-heuristic algorithms - Case study: Production Scheduling Problem

    In this study, given the sequence dependent setup times, we attempt using the technique of Response Surface Methodology (RSM) to set the parameters of the genetic algorithm (GA), which is used to optimize the scheduling problem of n job on 1 machine (n/1). It aims at finding the most suitable parameters for increasing the efficiency of the proposed algorithm. At first, a central composite d...

متن کامل

A modified branch and bound algorithm for a vague flow-shop scheduling problem

Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...

متن کامل

Modelling and solving the job shop scheduling Problem followed by an assembly stage considering maintenance operations and access restrictions to machines

This paper considers job shop scheduling problem followed by an assembly stage and Lot Streaming (LS). It is supposed here that a number of products have been ordered to be produced. Each product is assembled with a set of several parts. The production system includes two stages. The first stage is a job shop to produce parts. Each machine can process only one part at the same time. The second ...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

A Reliability based Modelling and Optimization of an Integrated Production and Preventive Maintenance Activities in Flowshop Scheduling Problem

Traditional scheduling problems with the batch processing machines (BPM) assume that machines are continuously available, and no time is needed for their preventive maintenance (PM). In this paper, we study a realistic variant of flowshop scheduling which integrates flow shop batch processing machines (FBPM) and preventive maintenance for minimizing the makespan. In order to tackle the given pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013